Achieving differentiated services through multi-class probabilistic priority scheduling
نویسندگان
چکیده
منابع مشابه
Achieving differentiated services through multi-class probabilistic priority scheduling
Differentiated services (DiffServ) is a promising architecture for the next generation Internet due to its scalable and flexible design. In DiffServ, scheduling disciplines play an important role in achieving service differentiation. In this paper, we extend the average delay analysis of the probabilistic priority (PP) scheduling discipline first proposed in [Proc. 2001 IEEE Workshop on High Pe...
متن کاملAchieving differentiated services through multi - class 3 probabilistic priority scheduling 4
11 Differentiated services (DiffServ) is a promising architecture for the next generation Internet due to its scalable and 12 flexible design. In DiffServ, scheduling disciplines play an important role in achieving service differentiation. In this 13 paper, we extend the average delay analysis of the probabilistic priority (PP) scheduling discipline first proposed in 14 [Proc. 2001 IEEE Worksho...
متن کاملA multi-class probabilistic priority scheduling discipline for differentiated services networks
Differentiated Services (DiffServ) is a promising architecture for the next generation Internet due to its highly flexible, scalable and interoperable design. In DiffServ, scheduling disciplines play an important role in achieving service differentiation. In this paper, we extend the average delay analysis of the Probabilistic Priority (PP) scheduling discipline first proposed in [8] to the mul...
متن کاملAchieving Relative Differentiated Services Using Proportional Probabilistic Priority Scheduling on Network Processor
This paper studies the design and performance of the Probabilistic Priority (PP) packet scheduling algorithm to schedule packets. Unlike an earlier design that uses fractional arithmetic and prohibits large number of classes, we present an integer PP algorithm and show that PP is a special scheme of applying lottery scheduling to bandwidth allocation in a strict priority sense. We then propose ...
متن کاملEfficient implementation of relative differentiated services using proportional probabilistic priority
This paper studies the design and performance of the Probabilistic Priority (PP) [5] packet scheduling algorithm to schedule packets. Unlike an earlier design that uses fractional arithmetic and prohibits large number of classes, we present an integer PP algorithm and show that PP turns out to be a special scheme of applying lottery scheduling [10] to bandwidth allocation in a strict priority s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Networks
سال: 2002
ISSN: 1389-1286
DOI: 10.1016/s1389-1286(02)00309-2